<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>NINJA: NINJA/TreeBuilderBinHeap.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">NINJA
   &#160;<span id="projectnumber">2.x</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('_tree_builder_bin_heap_8hpp_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">TreeBuilderBinHeap.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="_tree_builder_bin_heap_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="_binary_heap___int_key___two_ints_8hpp.html">BinaryHeap_IntKey_TwoInts.hpp</a>&quot;</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="_stack_8hpp.html">Stack.hpp</a>&quot;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="_tree_builder_8hpp.html">TreeBuilder.hpp</a>&quot;</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160; </div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="preprocessor">#include &lt;climits&gt;</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160; </div>
<div class="line"><a name="l00007"></a><span class="lineno"><a class="line" href="class_tree_builder_bin_heap.html">    7</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_tree_builder_bin_heap.html">TreeBuilderBinHeap</a> : <span class="keyword">public</span> <a class="code" href="class_tree_builder.html">TreeBuilder</a> {</div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <a class="code" href="class_tree_builder_bin_heap.html#abbd80cd829cf7f5187fb6bfa7057256c">TreeBuilderBinHeap</a>(std::string **<a class="code" href="class_tree_builder.html#adf035970b6627d0249558400609b2cf9">names</a>, <span class="keywordtype">int</span> **distances, <span class="keywordtype">int</span> namesSIze);</div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160; </div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <a class="code" href="class_tree_builder_bin_heap.html#af7ddcc75b903a4a5cd43541543a7ad60">~TreeBuilderBinHeap</a>();</div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160; </div>
<div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="class_tree_builder_bin_heap.html#a5bd710b0c3d0aa17d815e34b8dca0993">   13</a></span>&#160;    <span class="keywordtype">int</span> *<a class="code" href="class_tree_builder_bin_heap.html#a5bd710b0c3d0aa17d815e34b8dca0993">candidateCountPerLoop</a>;</div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160; </div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <a class="code" href="class_tree_node.html">TreeNode</a> **<a class="code" href="class_tree_builder_bin_heap.html#a55103dd4bc84a5338920f08e7d943001">build</a>();</div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160; </div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keyword">private</span>:</div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <a class="code" href="class_binary_heap___int_key___two_ints.html">BinaryHeap_IntKey_TwoInts</a> ***heaps;</div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160; </div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">int</span> *clustAssignments;</div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;    <span class="keywordtype">long</span> *clustPercentiles;</div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keywordtype">int</span> *clustersBySize;</div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">int</span> *clustSizes;</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160; </div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <a class="code" href="struct_int.html">Int</a> candidatesD;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <a class="code" href="struct_int.html">Int</a> candidatesI;</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <a class="code" href="struct_int.html">Int</a> candidatesJ;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;    <span class="keywordtype">bool</span> *candidatesActive;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    <a class="code" href="class_stack.html">Stack</a> *freeCandidates;</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    <span class="keywordtype">int</span> lastCandidateIndex;</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160; </div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    <span class="keywordtype">void</span> clusterAndHeap(<span class="keywordtype">int</span> maxIndex);</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160; </div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">int</span> appendCandidate(<span class="keywordtype">int</span> d, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j);</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;};</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160; </div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160; </div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="aclass_tree_node_html"><div class="ttname"><a href="class_tree_node.html">TreeNode</a></div><div class="ttdef"><b>Definition:</b> TreeNode.hpp:9</div></div>
<div class="ttc" id="aclass_tree_builder_html"><div class="ttname"><a href="class_tree_builder.html">TreeBuilder</a></div><div class="ttdef"><b>Definition:</b> TreeBuilder.hpp:9</div></div>
<div class="ttc" id="aclass_stack_html"><div class="ttname"><a href="class_stack.html">Stack</a></div><div class="ttdef"><b>Definition:</b> Stack.hpp:9</div></div>
<div class="ttc" id="aclass_tree_builder_html_adf035970b6627d0249558400609b2cf9"><div class="ttname"><a href="class_tree_builder.html#adf035970b6627d0249558400609b2cf9">TreeBuilder::names</a></div><div class="ttdeci">std::string ** names</div><div class="ttdef"><b>Definition:</b> TreeBuilder.hpp:25</div></div>
<div class="ttc" id="aclass_tree_builder_bin_heap_html_af7ddcc75b903a4a5cd43541543a7ad60"><div class="ttname"><a href="class_tree_builder_bin_heap.html#af7ddcc75b903a4a5cd43541543a7ad60">TreeBuilderBinHeap::~TreeBuilderBinHeap</a></div><div class="ttdeci">~TreeBuilderBinHeap()</div><div class="ttdef"><b>Definition:</b> TreeBuilderBinHeap.cpp:35</div></div>
<div class="ttc" id="astruct_int_html"><div class="ttname"><a href="struct_int.html">Int</a></div><div class="ttdef"><b>Definition:</b> BinaryHeap.hpp:10</div></div>
<div class="ttc" id="aclass_tree_builder_bin_heap_html_abbd80cd829cf7f5187fb6bfa7057256c"><div class="ttname"><a href="class_tree_builder_bin_heap.html#abbd80cd829cf7f5187fb6bfa7057256c">TreeBuilderBinHeap::TreeBuilderBinHeap</a></div><div class="ttdeci">TreeBuilderBinHeap(std::string **names, int **distances, int namesSIze)</div><div class="ttdef"><b>Definition:</b> TreeBuilderBinHeap.cpp:3</div></div>
<div class="ttc" id="a_tree_builder_8hpp_html"><div class="ttname"><a href="_tree_builder_8hpp.html">TreeBuilder.hpp</a></div></div>
<div class="ttc" id="aclass_tree_builder_bin_heap_html_a5bd710b0c3d0aa17d815e34b8dca0993"><div class="ttname"><a href="class_tree_builder_bin_heap.html#a5bd710b0c3d0aa17d815e34b8dca0993">TreeBuilderBinHeap::candidateCountPerLoop</a></div><div class="ttdeci">int * candidateCountPerLoop</div><div class="ttdef"><b>Definition:</b> TreeBuilderBinHeap.hpp:13</div></div>
<div class="ttc" id="a_binary_heap___int_key___two_ints_8hpp_html"><div class="ttname"><a href="_binary_heap___int_key___two_ints_8hpp.html">BinaryHeap_IntKey_TwoInts.hpp</a></div></div>
<div class="ttc" id="aclass_tree_builder_bin_heap_html_a55103dd4bc84a5338920f08e7d943001"><div class="ttname"><a href="class_tree_builder_bin_heap.html#a55103dd4bc84a5338920f08e7d943001">TreeBuilderBinHeap::build</a></div><div class="ttdeci">TreeNode ** build()</div><div class="ttdef"><b>Definition:</b> TreeBuilderBinHeap.cpp:175</div></div>
<div class="ttc" id="aclass_binary_heap___int_key___two_ints_html"><div class="ttname"><a href="class_binary_heap___int_key___two_ints.html">BinaryHeap_IntKey_TwoInts</a></div><div class="ttdef"><b>Definition:</b> BinaryHeap_IntKey_TwoInts.hpp:12</div></div>
<div class="ttc" id="a_stack_8hpp_html"><div class="ttname"><a href="_stack_8hpp.html">Stack.hpp</a></div></div>
<div class="ttc" id="aclass_tree_builder_bin_heap_html"><div class="ttname"><a href="class_tree_builder_bin_heap.html">TreeBuilderBinHeap</a></div><div class="ttdef"><b>Definition:</b> TreeBuilderBinHeap.hpp:7</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_994258571ff4fe75827c48a736f217ad.html">NINJA</a></li><li class="navelem"><a class="el" href="_tree_builder_bin_heap_8hpp.html">TreeBuilderBinHeap.hpp</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
  </ul>
</div>
</body>
</html>
